Event-clock automata: a determinizable class of timed automata
نویسندگان
چکیده
منابع مشابه
Event-Clock Automata: A Determinizable Class of Timed Automata
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a. The class of event-recording automata is, on one hand, expressive enough to model ( nite) timed transition systems and, on the other hand, determinizable and closed under all boolean operations. As a result, the lan...
متن کاملWhen Are Timed Automata Determinizable?
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boundedness condition, the infinite timed tree can be reduced into a classical deterministic timed automaton. The boundedness condition is satisfied by several subclasses of timed automata, some of them were known to be d...
متن کاملOptimal Clock Allocation for a Class of Timed Automata
We address the problem of allocating a minimal number of clocks to timed automata. To make the problem tractable we assume that all locations are reachable. We identify a fairly general class of timed automata, TADS , for which there is an algorithm whose complexity is quadratic in the size of the graph.
متن کاملDistributed Event Clock Automata
In distributed real-time systems, we cannot assume that clocks are perfectly synchronized. To model them, we borrow independent clocks from independent clocks timed automata (icTA). First, we define the timed universal and existential semantics icTA. The emptiness of universal timed language of an icTA, and the timed language inclusion of icTA are undecidable. To recover decidability, we propos...
متن کاملEvent-Clock Nested Automata
In this paper we introduce and study Event-Clock Nested Automata (ECNA), a formalism that combines Event Clock Automata (ECA) and Visibly Pushdown Automata (VPA). ECNA allow to express real-time properties over non-regular patterns of recursive programs. We prove that ECNA retain the closure and decidability properties of ECA and VPA being closed under Boolean operations and having a decidable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00173-4